Controlled Markov Elds with Nite State Space on Graphs Controlled Markov Elds with Nite State Space on Graphs
نویسندگان
چکیده
Discrete time Markov chains with multidimensional state space are considered where the coordinates are locally interacting and develop synchronously. The interaction structure of the process is given by some general graph. Decision makers control the sys-tem's behaviour on the coordinate level using only local information. In the class of local strategies there exist deterministic stationary strategies with achieve minimal asymptotic average expected costs. If the cost structure is separabel these strategies are even globally optimal.
منابع مشابه
Convolution Kernels on Discrete Structures UCSC CRL
We introduce a new method of constructing kernels on sets whose elements are discrete structures like strings trees and graphs The method can be applied iteratively to build a kernel on a in nite set from kernels involving generators of the set The family of kernels generated generalizes the family of radial basis kernels It can also be used to de ne kernels in the form of joint Gibbs probabili...
متن کاملAN APPLICATION OF TRAJECTORIES AMBIGUITY IN TWO-STATE MARKOV CHAIN
In this paper, the ambiguity of nite state irreducible Markov chain trajectories is reminded and is obtained for two state Markov chain. I give an applicable example of this concept in President election
متن کاملPropp-Wilson Algorithms And Finitary Codings For High Noise Markov Random Fields
In this paper, we combine two previous works, the rst being by the rst author and K. Nelander, and the second by J. van den Berg and the second author, to show (1) that one can carry out a Propp{Wilson exact simulation for all Markov random elds on Z d satisfying a certain high noise assumption, and (2) that all such random elds are a nitary image of a nite state i.i.d. process. (2) is a streng...
متن کاملA Different Construction of Gaussian Fields from Markov Chains: Dirichlet Covariances
We study a class of Gaussian random elds with negative correlations. These elds are easy to simulate. They are de ned in a natural way from a Markov chain that has the index space of the Gaussian eld as its state space. In parallel with Dynkin's investigation of Gaussian elds having covariance given by the Green's function of a Markov process, we develop connections between the occupation times...
متن کاملMcmc Convergence Diagnostic via the Central Limit Theorem
Markov Chain Monte Carlo (MCMC) methods, as introduced by Gelfand and Smith (1990), provide a simulation based strategy for statistical inference. The application elds related to these methods, as well as theoretical convergence properties, have been intensively studied in the recent literature. However, many improvements are still expected to provide workable and theoretically well-grounded so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000